Asymptotic Behavior of Iwasawa and Cholesky Iterations

نویسندگان

  • RANDALL R. HOLMES
  • HUAJUN HUANG
چکیده

We extend, in the context of a connected real semisimple Lie group, some results on the QR iteration and the Cholesky iteration of a nonsingular matrix. A group theoretic understanding of the abstract mechanisms of the iterations is obtained.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On the Iwasawa decomposition of a symplectic matrix

We consider the computation of the Iwasawa decomposition of a symplectic matrix via the QR factorization. The algorithms presented improve on the method recently described by T.-Y. Tam in [Computing Iwasawa decomposition of a symplectic matrix by Cholesky factorization, Appl. Math. Lett. (in press) doi:10.1016/j.aml.2006.03.001]. c © 2006 Elsevier Ltd. All rights reserved.

متن کامل

Computing the Iwasawa decomposition of a symplectic matrix by Cholesky factorization

We obtain an explicit Iwasawa decomposition of the symplectic matrices, complex or real, in terms of the Cholesky factorization for positive definite n×n matrices. We also provide a MATLAB program to compute the decomposition. 1. Iwasawa decomposition of the symplectic groups Let G be the real (noncompact) symplectic group [3, p.129] (the notation there is Spn), [4, p.265] G := Spn(R) = {g ∈ SL...

متن کامل

Gradient Eigenanalysis Onnested Finite

The eecient computation of the leftmost eigenpairs of the generalized symmetric eigenproblem Ax = Bx by a de-ation accelerated conjugate gradient (DACG) method may be enhanced by an improved estimate of the initial eigenvectors obtained with a multigrid (MG) type approach. The DACG algorithm essentially optimizes the Rayleigh quotient in subspaces of decreasing size B-orthogonal to the eigenvec...

متن کامل

Incomplete Cholesky Factorizations with Limited Memory

We propose an incomplete Cholesky factorization for the solution of large-scale trust region subproblems and positive definite systems of linear equations. This factorization depends on a parameter p that specifies the amount of additional memory (in multiples of n, the dimension of the problem) that is available; there is no need to specify a drop tolerance. Our numerical results show that the...

متن کامل

Asymptotic Behavior of Weighted Sums of Weakly Negative Dependent Random Variables

Let be a sequence of weakly negative dependent (denoted by, WND) random variables with common distribution function F and let be other sequence of positive random variables independent of and for some and for all . In this paper, we study the asymptotic behavior of the tail probabilities of the maximum, weighted sums, randomly weighted sums and randomly indexed weighted sums of heavy...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2011